Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
نویسنده
چکیده
A new weak shared coin protocol yields a randomized waitfree shared-memory consensus protocol that uses an optimal O(n) expected total work with single-writer registers despite asynchrony and process crashes. Previously, no protocol was known that achieved this bound without using multi-writer registers.
منابع مشابه
Efficient Atomic Snapshots U sing Lattice Agreement ( Preliminary
The snapshot object is an important tool for constructing wait-free asynchronous algorithms. We relate the snapshot object to the lattice agreement decision problem. It is shown that any algorithm for solving lattice agreement can be transformed into an implementation of a snapshot object. The overhead cost of this transformation is only a linear number of operations on atomic single-writer mul...
متن کاملRandomized Wait-Free Consensus Using an Atomicity Assumption
We present a randomized algorithm for asynchronous waitfree consensus using multi-writer multi-reader shared registers. This algorithm is based on earlier work by Chor, Israeli and Li (CIL) and is correct under the assumption that processes can perform a random choice and a write operation in one atomic step. The expected total work for our algorithm is shown to be O(N log(logN)), compared with...
متن کاملCombining shared-coin algorithms
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Bracha and Rachman [10] and of Aspnes and Waarts [7], this yields a shared coin algorithm, and hence, a randomized consensus algorithm, with O(n log n) individual work and O(n log n) total work, using single-writer registe...
متن کاملAsynchronous Consensus with Bounded Memory
We present here a bounded memory consensus Obstruction-Free algorithm for the asynchronous shared memory model. More precisely for a set of n processes, this algorithm uses n + 1 multi-writer multi-reader (MWMR) registers, each of these registers being of size O(log(n)) bits. Then we get a O(n log(n))-bits size complexity consensus algorithm with single-writer multi-reader (SWMR) registers and ...
متن کاملEight Open Problems in Distributed Computing
Distributed Computing Theory continues to be one of the most active research fields in Theoretical Computer Science today. Besides its foundational topics (such as consensus and synchronization), it is currently being enriched with many new topics inspired from modern technological advances (e.g., the Internet). In this note, we present eight open problems in Distributed Computing Theory that s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011